Encrypted Domain DCT Based on Homomorphic Cryptosystems
نویسندگان
چکیده
Signal processing in the encrypted domain (s.p.e.d.) appears an elegant solution in application scenarios where valuable signals must be protected from a possibly malicious processing device. In this paper we consider the application of the Discrete Cosine Transform (DCT) to images encrypted by using an appropriate homomorphic cryptosystem. A s.p.e.d. 1-dimensional DCT is obtained by defining a convenient signal model, and is extended to the 2-dimensional case by using separable processing of rows and columns. The bounds imposed by the cryptosystem on the size of the DCT and the arithmetic precision are derived, considering both the direct DCT algorithm and its fast version. Particular attention is given to block-based DCT (BDCT), with emphasis on the possibility of lowering the computational burden by parallel application of the s.p.e.d. DCT to different image blocks. The application of the s.p.e.d. 2D-DCT and 2D-BDCT to 8-bit greyscale images is analyzed, whereas a case study demonstrates the feasibility of the s.p.e.d. DCT in a practical scenario.
منابع مشابه
On non-abelian homomorphic public-key cryptosystems
An important problem of modern cryptography concerns secret public-key computations in algebraic structures. We construct homomorphic cryptosystems being (secret) epimorphisms f : G → H, where G,H are (publically known) groups and H is finite. A letter of a message to be encrypted is an element h ∈ H, while its encryption g ∈ G is such that f(g) = h. A homomorphic cryptosystem allows one to per...
متن کاملAdditively Homomorphic Encryption with d-Operand Multiplications
The search for encryption schemes that allow to evaluate functions (or circuits) over encrypted data has attracted a lot of attention since the seminal work on this subject by Rivest, Adleman and Dertouzos in 1978. In this work we define a theoretical object, chained encryption schemes, which allow an efficient evaluation of polynomials of degree d over encrypted data. Chained encryption scheme...
متن کاملIntroduction to Homomorphic Encryption
Homomorphic encryption enables computations on encrypted data. This property makes such encryption schemes useful in a wide variety of privacy preserving applications. This paper provides a brief survey on the homomorphic encryption. We describe the homomorphic cryptosystems from partially homomorphic encryption to fully homomorphic encryption. We also give some security analysis and describe h...
متن کاملCryptoComputing with Rationals
In this paper we describe a method to compute with encrypted rational numbers. It is well-known that homomorphic schemes allow calculations with hidden integers, i.e. given integers x and y encrypted in E(x) and E(y), one can compute the encrypted sum E(x + y) or the encrypted product E(kx) of the encrypted integer x and a known integer k without having to decrypt the terms E(x) or E(y). Such c...
متن کاملA Survey of Homomorphic Encryption Schemes in Cloud Data Storage
Cloud Computing technology is enabling IT managers to treat infrastructure as a common substrate on which they can provide services to users in a faster, more flexible and cost effective way. Despite the trumpeted business and technical advantages of cloud computing, many potential users are yet to join the cloud and those who are cloud users put only their less sensitive data in the cloud. Lac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- EURASIP J. Information Security
دوره 2009 شماره
صفحات -
تاریخ انتشار 2009